منابع مشابه
Dynamic Rebinding for Distributed Programming
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises. Typically it is provided only by ad-hoc mechanisms that lack clean semantics. In this paper we adopt a more foundational approach, showing how core dynamic rebinding mechanisms can be added to a CBV λ-calculus...
متن کاملOptimal Rejuvenation Scheduling of Distributed Computation Based on Dynamic Programming
Recently, a complementary approach to handle transient software failures, called software rejuvenation, is becoming popular as a proactive fault management technique in operational software systems. In this study, we develop the optimal scheduling algorithms to trigger software rejuvenation in distributed computation circumstance. In particular, we focus on two different computation circumstanc...
متن کاملMultidimensional Dynamic Programming for Homology Search on Distributed Systems
Alignment problems in computational biology have been focused recently because of the rapid growth of sequence databases. By computing alignment, we can understand similarity among the sequences. Dynamic programming is a technique to find optimal alignment, but it requires very long computation time. We have shown that dynamic programming for more than two sequences can be efficiently processed...
متن کاملOn Dynamic Distributed Computing
The history of distributed computing is strongly tied to the assumption of a static network composed predominantly of honest nodes. Yet, many modern distributed systems not only are not static but exhibit a high level of churn. This paper demonstrates how to achieve distributed computing in a highly dynamic environment despite the presence of a static Byzantine adversary controlling a large fra...
متن کاملDistributed dynamic load balancing for task parallel programming
In this paper, we derive and investigate approaches to dynamically load balance a distributed task parallel application software. The load balancing strategy is based on task migration. Busy processes export parts of their ready task queue to idle processes. Idle–busy pairs of processes find each other through a random search process that succeeds within a few steps with high probability. We ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1992
ISSN: 0018-9286
DOI: 10.1109/9.135517